Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
نویسندگان
چکیده
منابع مشابه
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge. A non-1-planar graph G is minimal if the graph G − e is 1-planar for every edge e of G. We construct two infinite families of minimal non-1-planar graphs and show that for every integer n ≥ 63, there are at least 2(n−54)/4 nonisomorphic minimal non-1-planar graphs of order n. It is a...
متن کاملIntrinsic Obstructions to the Existence of Isometric Minimal Immersions
S.S. Chern raised the problem to find necessary and sufficient conditions for a given Riemannian manifold to be realizable on a minimal submanifold of a Euclidean space. The aim of this paper is to provide new necessary conditions. For minimal submanifolds in a Euclidean space we consider the negative of the Ricci tensor as defining a new metric, which is nothing but the third fundamental form,...
متن کاملA Note on Obstructions to Clustered Planarity
A planar digraph D is clustered planar if in some planar embedding of D we have at each vertex the in-arcs occurring sequentially in the local rotation. By supplementing the operations used to form the usual minors in Kuratowski’s theorem, clustered planar digraphs are characterised.
متن کاملModuli for Spherical Eigenmaps and Minimal Immersions
Eigenmaps and spherical minimal immersions of round spheres into round spheres form an interesting subject that has been studied by many authors. The components of an eigenmap are eigenfunctions of the Laplace-Beltrami operator on Sm, the Euclidean m-sphere, m ≥ 2; and the eigenfunctions correspond to a fixed eigenvalue λk, k ≥ 1. Given m ≥ 2 and k ≥ 1, these eigenmaps can be parametrized by a ...
متن کاملParameterized Complexity of 1-Planarity
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the parameterized complexity of the problem with respect to the vertex cover number, tree-depth, and cyclomatic number. For these parameters we construct fixed-parameter ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2012
ISSN: 0364-9024
DOI: 10.1002/jgt.21630